Search results

Every day, small and big incidents happen all over the world, and given the human, financial and spiritual damage they cause, proper planning should be sought to deal with them so they can be appropriately managed in times of crisis. This study aims to examine humanitarian supply chain models.

A new model is developed to pursue the necessary relations in an optimal way that will minimize human, financial and moral losses. In this developed model, in order to optimize the problem and minimize the amount of human and financial losses, the following subjects have been applied: magnitude of the areas in which an accident may occur as obtained by multiple attribute decision-making methods, the distances between relief centers, the number of available rescuers, the number of rescuers required and the risk level of each patient which is determined using previous data and machine learning (ML) algorithms.

For this purpose, a case study in the east of Tehran has been conducted. According to the results obtained from the algorithms, problem modeling and case study, the accuracy of the proposed model is evaluated very well.

Obtaining each injured person's priority using ML techniques and each area's importance or risk level, besides developing a bi-objective mathematical model and using multiple attribute decision-making methods, make this study unique among very few studies that concern ML in the humanitarian supply chain. Moreover, the findings validate the results and the model's functionality very well.

Due to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the needs of the people. After the disaster, one of the most essential measures is to deliver relief supplies to those affected by the disaster. Therefore, this paper aims to assign demand points to the warehouses as well as routing their related relief vehicles after a disaster considering convergence in the border warehouses.

This research proposes a multi-objective, multi-commodity and multi-period queueing-inventory-routing problem in which a queuing system has been applied to reduce the congestion in the borders of the affected zones. To show the validity of the proposed model, a small-size problem has been solved using exact methods. Moreover, to deal with the complexity of the problem, a metaheuristic algorithm has been utilized to solve the large dimensions of the problem. Finally, various sensitivity analyses have been performed to determine the effects of different parameters on the optimal response.

According to the results, the proposed model can optimize the objective functions simultaneously, in which decision-makers can determine their priority according to the condition by using the sensitivity analysis results.

The focus of the research is on delivering relief items to the affected people on time and at the lowest cost, in addition to preventing long queues at the entrances to the affected areas.

In recent decades, the student population in dormitories has increased notably, primarily attributed to the growing number of international students. Dormitories serve as pivotal environments for student development. The coordination and compatibility among students can significantly influence their overall success. This study aims to introduce an innovative method for roommate selection and room allocation within dormitory settings.

In this study, initially, using multi-attribute decision-making methods including the Bayesian best-worst method and weighted aggregated sum product assessment, the incompatibility rate among pairs of students is calculated. Subsequently, using a linear mathematical model, roommates are selected and allocated to dormitory rooms pursuing the twin objectives of minimizing the total incompatibility rate and costs. Finally, the grasshopper optimization algorithm is applied to solve large-sized instances.

The results demonstrate the effectiveness of the proposed method in comparison to two common alternatives, i.e. random allocation and preference-based allocation. Moreover, the proposed method’s applicability extends beyond its current context, making it suitable for addressing various matching problems, including crew pairing and classmate pairing.

This novel method for roommate selection and room allocation enhances decision-making for optimal dormitory arrangements. Inspired by a real-world problem faced by the authors, this study strives to offer a robust solution to this problem.

Nowadays, in many organizations, products are not delivered instantly. So, the customers should wait to receive their needed products, which will form a queueing-inventory model. Waiting a long time in the queue to receive products may cause dissatisfaction and churn of loyal customers, which can be a significant loss for organizations. Although many studies have been done on queueing-inventory models, more practical models in this area are needed, such as considering customer prioritization. Moreover, in many models, minimizing the total cost for the organization has been overlooked.

This paper will compare several machine learning (ML) algorithms to prioritize customers. Moreover, benefiting from the best ML algorithm, customers will be categorized into different classes based on their value and importance. Finally, a mathematical model will be developed to determine the allocation policy of on-hand products to each group of customers through multi-channel service retailing to minimize the organization’s total costs and increase the loyal customers' satisfaction level.

To investigate the application of the proposed method, a real-life case study on vaccine distribution at Imam Khomeini Hospital in Tehran has been addressed to ensure model validation. The proposed model’s accuracy was assessed as excellent based on the results generated by the ML algorithms, problem modeling and case study.

Prioritizing customers based on their value with the help of ML algorithms and optimizing the waiting queues to reduce customers' waiting time based on a mathematical model could lead to an increase in satisfaction levels among loyal customers and prevent their churn. This study’s uniqueness lies in its focus on determining the policy in which customers receive products based on their value in the queue, which is a relatively rare topic of research in queueing management systems. Additionally, the results obtained from the study provide strong validation for the model’s functionality.